Point Set Isolation Using Unit Disks is NP-complete
نویسندگان
چکیده
We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is intersected by at least one disk is NP-complete. This settles an open problem raised in [1]. Using a similar reduction, we show that finding a minimum cardinality D′ ⊆ D such that R 2 \ ⋃ (D \D′) consists of a single connected region is also NPcomplete. Lastly, we show that the Multiterminal Cut Problem remains NP-complete when restricted to unit disk graphs.
منابع مشابه
Approximation Algorithms for Geometric Covering Problems for Disks and Squares
Geometric covering is a well-studied topic in computational geometry. We study three covering problems: Disjoint Unit-Disk Cover, Depth-(≤ K) Packing and Red-Blue UnitSquare Cover. In the Disjoint Unit-Disk Cover problem, we are given a point set and want to cover the maximum number of points using disjoint unit disks. We prove that the problem is NP-complete and give a polynomial-time approxim...
متن کاملGeometric Unique Set Cover on Unit Disks and Unit Squares
We study the Unique Set Cover problem on unit disks and unit squares. For a given set P of n points and a set D of m geometric objects both in the plane, the objective of the Unique Set Cover problem is to select a subset D′ ⊆ D of objects such that every point in P is covered by at least one object in D′ and the number of points covered uniquely is maximized, where a point is covered uniquely ...
متن کاملIdentification of points using disks
We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an instance of the test covering problem with geometric constraints on the tests. We give tight lower and upper bounds on the number of disks needed to identify...
متن کاملHardness of Liar's Domination on Unit Disk Graphs
A unit disk graph is the intersection graph of a set of unit diameter disks in the plane. In this paper we consider liar’s domination problem on unit disk graphs, a variant of dominating set problem. We call this problem as Euclidean liar’s domination problem. In the Euclidean liar’s domination problem, a set P = {p1, p2, . . . , pn} of n points (disk centers) are given in the Euclidean plane. ...
متن کاملCovering Points by Unit Disks of Fixed Location
Given a set P of points in the plane, and a set D of unit disks of fixed location, the discrete unit disk cover problem is to find a minimum-cardinality subset D′ ⊆ D that covers all points of P . This problem is a geometric version of the general set cover problem, where the sets are defined by a collection of unit disks. It is still NP-hard, but while the general set cover problem is not appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1303.2779 شماره
صفحات -
تاریخ انتشار 2012